REGULAR FORM SPECIFICATION OF L LANGUAGE DETERMINISTIC AUTOMATA
نویسندگان
چکیده
منابع مشابه
Cooperative Tasking for Deterministic Specification Automata
In our previous work [1], a divide-and-conquer approach was proposed for cooperative tasking among multi-agent systems. The basic idea is to decompose a requested global specification into subtasks for individual agents such that the fulfillment of these subtasks by each individual agent leads to the satisfaction of the global specification as a team. It was shown that not all tasks can be deco...
متن کاملFrom Regular Expressions to Deterministic Automata
The main theorem allows an elegant algorithm to be refined into an efficient one. The elegant algorithm for constructing a finite automaton from a regular expression is based on 'derivatives of' regular expressions; the efficient algorithm is based on 'marking of' regular expressions. Derivatives of regular expressions correspond to state transitions in finite automata. When a finite automaton ...
متن کاملRegular Expressions From Deterministic Finite Automata, Revisited
We continue our research on the conversion of deterministic finite automata to equivalent regular expressions from [H. Gruber, M. Holzer: Provably Shorter Regular Expressions from Deterministic Finite Automata. In: 12th DLT, Number 5257 of LNCS, 2008], where it was shown that every language over a binary alphabet accepted by an n-state deterministic finite automaton can be converted into an equ...
متن کاملA Bialgebraic Review of Regular Expressions, Deterministic Automata and Languages
This papers reviews the classical theory of deterministic automata and regular languages from a categorical perspective. The basis is formed by Rutten's description of the Brzozowski automaton structure in a coalgebraic framework. We enlarge the framework to a so-called bialgebraic one, by including algebras together with suitable distributive laws connecting the algebraic and coalgebraic struc...
متن کاملProvably Shorter Regular Expressions from Deterministic Finite Automata
We study the problem of finding good elimination orderings for the state elimination algorithm, which is one of the most popular algorithms for the conversion of finite automata into equivalent regular expressions. Based on graph separator techniques we are able to describe elimination strategies that remove states in large induced subgraphs that are “simple” like, e.g., independent sets or sub...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science-based technologies
سال: 2009
ISSN: 2310-5461,2075-0781
DOI: 10.18372/2310-5461.1.5262